Algorithmic Approach for Solving Transportation Problems
نویسندگان
چکیده
منابع مشابه
Algorithmic Problems in Optimal Transportation
In this document, I outline a few challenging algorithmic problems arising in my research on optimal transportation. I have attempted to pose these problems in “discrete” language. It easily could be the case that they admit straightforward solutions— which is great news!—or that you can do little more than the obvious algorithm. Any and all guidance from members of the theory community is welc...
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملA New Approach for Solving Unbalanced Fuzzy Transportation Problems
In this paper, new methodologies are proposed for solving unbalanced fuzzy transportation problems without converting into a balanced one. The advantages of these methodologies are to get an optimal solution. In the proposed method, transportation costs, demand and supply are represented by triangular fuzzy numbers. To illustrate the proposed method, numerical examples are solved and the obtain...
متن کاملA New Approach for Solving Solid Transportation Problems
A new method using the principle of zero point method [10] is proposed for finding an optimal solution of solid transportation problems. The proposed method yields an optimal solution of the given solid transportation problem directly . It is very easy to understand and apply which can serve managers by providing the optimal solution to a variety of distribution problems involving three items. ...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Global Journal of Pure and Applied Mathematics
سال: 2015
ISSN: 0973-9750,0973-1768
DOI: 10.37622/gjpam/11.5.2015.3743-3749